Weakly Stable Sets of NTU Game
نویسندگان
چکیده
منابع مشابه
On Bargaining Sets of Convex NTU Games
We show that the Aumann-Davis-Maschler bargaining set and the Mas-Colell bargaining set of a non-leveled NTU game that is either ordinal convex or coalition merge convex coincides with the core of the game. Moreover, we show by means of an example that the foregoing statement may not be valid if the NTU game is marginal convex.
متن کاملAn NTU Game Approach to Patent Licensing: Stable Bargaining Outcomes under Two Licensing Policies
By formulating negotiations about licensing payments as cooperative games without side payments, we investigate stable bargaining outcomes in licensing a cost-reducing technology of an external patent holder to oligopolistic firms producing a homogeneous product under two licensing policies: fee and royalty. The final bargaining outcome in fee licensing is uniquely determined, because the NTU b...
متن کاملAn NTU Cooperative Game Theoretic View of Manipulating Elections
Social choice theory and cooperative (coalitional) game theory have become important foundations for the design and analysis of multiagent systems. In this paper, we use cooperative game theory tools in order to explore the coalition formation process in the coalitional manipulation problem. Unlike earlier work on a cooperative-game-theoretic approach to the manipulation problem [2], we conside...
متن کاملRecognizing Weakly Stable Matrices
A max-plus matrixA is called weakly stable if the sequence (orbit) x,A⊗x, A2⊗x, . . . does not reach an eigenvector of A for any x unless x is an eigenvector. This is in contrast to previously studied strongly stable (robust) matrices for which the orbit reaches an eigenvector with any nontrivial starting vector. Max-plus matrices are used to describe multiprocessor interactive systems for whic...
متن کاملAlmost Weakly 2-Generic Sets
There is a family of questions in relativized complexity theory|weak analogs of the Friedberg Jump-Inversion Theorem|that are resolved by 1-generic sets but which cannot be resolved by essentially any weaker notion of genericity. This paper deenes aw2-generic sets, i.e., sets which meet every dense set of strings that is r.e. in some incomplete r.e. set. Aw2-generic sets are very close to 1-gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Operations Research
سال: 2012
ISSN: 2160-8830,2160-8849
DOI: 10.4236/ajor.2012.21010